Algorithms for Noncommutative Differential Operators

The aim of this work is to study some noncommutative differential operators. We take an algorithmic approach as well as further developing the mathematics, and design and analyse algorithms to solve fundamental problems. We also give applications to differential equations. First we consider how to factor skew polynomials. These are polynomials in a differential or difference operator. Using the eigenring method, we present algorithms for computing factorizations and least common left multiple decompositions of skew polynomials over Fq(t), for a prime power q = p (here Fq is the finite field with q elements). Our algorithms are effective in the skew polynomial ring Fq(t)[D; σ, δ] (where Dt = σ(t)D + δ(t)), for any automorphism σ and any σ-derivation δ of Fq(t). Most importantly, these algorithms are the first to run in time polynomial in the degree of the input In the second part of this thesis, we presents theory and algorithms for noncommutative Gröbner bases in Poincaré-Birkhoff-Witt extensions. These extension rings generalize the previous domains over which non-commutative Gröbner bases have been applied. Our approach to noncommutative Gröbner bases differs from previous work, which assumes that the coefficients are from a field or commutative ring. This is relevant for computations involving Cartan’s theory of moving frames, and we explore these applications. In the third part of this thesis, we further our study of computations with moving frames, and extend the Rust-Riquier existence and uniqueness theory to analytic